Reusing Preconditioners in Projection Based Model Order Reduction Algorithms
نویسندگان
چکیده
منابع مشابه
On Model Order Reduction via Projection
The paper investigates the properties of reduced order models obtained by projection of a high order system. It answers questions such as are any two models of different orders related by a projection? Is it possible to obtain the same reduced order model using different projections? Etc. It is shown that in cases where not all models of a certain reduced order can be obtained by a projection, ...
متن کاملProjection-based model reduction for contact problems
To be feasible for computationally intensive applications such as parametric studies, optimization, and control design, large-scale finite element analysis requires model order reduction. This is particularly true in nonlinear settings that tend to dramatically increase computational complexity. Although significant progress has been achieved in the development of computational approaches for t...
متن کامل8 N ov 2 01 7 Stability preservation in Galerkin - type projection - based model order reduction
We consider linear dynamical systems consisting of ordinary differential equations with high dimensionality. The aim of model order reduction is to construct an approximating system of a much lower dimension. Therein, the reduced system may be unstable, even though the original system is asymptotically stable. We focus on projection-based model order reduction of Galerkin-type. A transformation...
متن کاملOn Some Recent Developments in Projection-based Model Reduction
In this paper, we describe some recent developments in the use of projection methods to produce reduced-order models for linear time-invariant dynamic systems. Previous related eeorts in model reduction problems from various applications are also discussed. An overview is given of the theory governing the deenition of the family of Rational Krylov methods, the practical heuristics involved and ...
متن کاملTheory and Algorithms for Partial Order Based Reduction in Planning
Search is a major technique for planning. It amounts to exploring a state space of planning domains typically modeled as a directed graph. However, prohibitively large sizes of the search space make search expensive. Developing better heuristic functions has been the main technique for improving search efficiency. Nevertheless, recent studies have shown that improving heuristics alone has certa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3009456